Partition Statistics for Cubic Partition Pairs
نویسنده
چکیده
In this brief note, we give two partition statistics which explain the following partition congruences: b(5n + 4) ≡ 0 (mod 5), b(7n + a) ≡ 0 (mod 7), if a = 2, 3, 4, or 6. Here, b(n) is the number of 4-color partitions of n with colors r, y, o, and b subject to the restriction that the colors o and b appear only in even parts.
منابع مشابه
EXPERIMENTALl ANALYSIS OF PARTITION COEFFICIENT IN Al-Mg ALLOYS
Because the partition coefficient is one of the most important parameters affecting microsegregation, the aim of this research is to experimentally analyse the partition coefficient in Al-Mg alloys. In order to experimentally measure the partition coefficient, a series of quenching experiments during solidification were carried out. For this purpose binary Al-Mg alloys containing 6.7 and 10.2 w...
متن کاملADMISSIBLE PARTITION FOR BL-GENERAL FUZZY AUTOMATON
In this note, we define the concepts of admissible relation and admissible partition for an arbitrary BL-general fuzzy automaton.In particular, a connection between the admissible partition and the quotient BL-general fuzzy automaton is presented.It is shown that if we use the maximal admissible partition, then we obtain a quotient BL-general fuzzy automaton and this quotient is minimal. Finall...
متن کاملTopological Expansion in the Complex Cubic Log - Gas Model . One - Cut Case
We prove the topological expansion for the cubic log-gas partition function
متن کاملOn the Dimer Problem and the Ising Problem in Finite 3-dimensional Lattices
We present a new expression for the partition function of the dimer arrangements and the Ising partition function of the 3-dimensional cubic lattice. We use the Pfaffian method. The partition functions are expressed by means of expectations of determinants and Pfaffians of matrices associated with the cubic lattice.
متن کاملk-Efficient partitions of graphs
A set $S = {u_1,u_2, ldots, u_t}$ of vertices of $G$ is an efficientdominating set if every vertex of $G$ is dominated exactly once by thevertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$%, we note that ${U_1, U_2, ldots U_t}$ is a partition of the vertex setof $G$ and that each $U_i$ contains the vertex $u_i$ and all the vertices atdistance~1 from it in $G$. In this ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 18 شماره
صفحات -
تاریخ انتشار 2011